Human Problem Solving : Sudoku Case Study ∗
نویسنده
چکیده
We discuss and evaluate metrics for difficulty rating of Sudoku puzzles. The correlation coefficient with human performance for our best metric is 0.95. The data on human performance were obtained from three web portals and they comprise thousands of hours of human solving over 2000 problems. We provide a simple computational model of human solving activity and evaluate it over collected data. Using the model we show that there are two sources of problem difficulty: complexity of individual steps (logic operations) and structure of dependency among steps. Beside providing a very good Sudoku-tuned metric, we also discuss a metric with few Sudoku-specific details, which still provides good results (correlation coefficient is 0.88). Hence we believe that the approach should be applicable to difficulty rating of other constraint satisfaction problems. This technical report is a full version of a paper presented at the 24th Florida Artificial Intelligence Research Society Conference.
منابع مشابه
An Exhaustive Study on different Sudoku Solving Techniques
Sudoku’ is the Japanese abbreviation of a longer phrase, ‘Suuji wa dokushin ni kagiru’, meaning ‘the digits must remain single’. It is a very popular puzzle that trains our logical mind. There are several approaches to solve this well-liked puzzle. In any case, the problem of solving a given Sudoku puzzle finds numerous applications in practice. In this paper, an exhaustive study has been made ...
متن کاملDifficulty Rating of Sudoku Puzzles: An Overview and Evaluation
How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on extensive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results are obtained using a computational model of human solving activity. Using the model we show that there are two sources of the problem difficulty: complexity of...
متن کاملNew Developments in Artificial Intelligence and the Semantic Web
This paper discusses solving and generating Sudoku puzzles with evolutionary algorithms. Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon. As an optimization problem Sudoku belongs to the group of combinatorial problems, but it is also a constraint satisfaction problem. The objective of this paper is to test if genetic algorithm optimization is an efficient method ...
متن کاملGenerating highly balanced sudoku problems as hard problems
Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8,44,3...
متن کاملSolving Puzzles ( Eg . Sudoku ) and Other Combinatorial Problems with Sat
There are many combinatorial puzzles around the world. Solving these puzzles is an intellectual challenge to human kinds. In computing, one way of solving these combinatorial puzzles is by modeling them as a satisfiablility problem (SAT). The SAT problem is to find given a propositional logic formula an assignment of the variables which makes the formula true. In this project, we use Sudoku, th...
متن کامل